A new procedure for decoding cyclic and BCH codes up to actual minimum distance
نویسندگان
چکیده
In this paper, a new procedure for decoding cyclic and BCH codes up to their actual minimum distance is presented. Previous algebraic decoding procedures for cyclic and BCH codes such as the Peterson decoding procedure and our procedure using nonrecurrent syndrome dependence relations can be regarded as special cases of this new decoding procedure. With the aid of a computer prokram, it has been verified that, using this new decoding procedure, all binary cyclic and BCH codes of length 63 or less can be decoded up to their actual minimum distance. The procedure incorporates an extension of our Fundamental Iterative Algorithm and the complexity of this decoding procedure is O(n') .
منابع مشابه
Decoding cyclic and BCH codes up to actual minimum distance using nonrecurrent syndrome dependence relations
The decoding capabilities of algebraic algorithms, mainly the Berlekamp-Massey algorithm, the Euclidean algorithm and our generalizations of these algorithms, are basically constrained by the minimum distance bounds of the codes. Thus, when the actual minimum distance of the codes is greater than that given by the bounds, these algorithms usually cannot fully utilize the error-correcting capabi...
متن کاملA new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann–Tzeng (HT) bound is formulated explicitly. We show that for many cases our approach improves the HT bound. Furthermore, we refine our bound for several families of cyclic codes. We define syndro...
متن کاملOn quasi-cyclic codes as a generalization of cyclic codes
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic codes of length lm and ideals of Ml(Fq)[X]/(X m −1). This permits to construct new classes of codes, namely quasi-BCH and quasi-evaluation codes. We study th...
متن کاملDecoding Procedure for BCH, Alternant and Goppa Codes defined over Semigroup Ring
In this paper we present a decoding principle for BCH, Alternant and Goppa codes constructed through a semigroup ring, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight t ≤ r, i.e., whose minimum Hamming distance is 2r + 1. Key-word: Semigroup rings, BCH codes, Alternant codes, Goppa codes, modified BerlekampMassey algorithm.
متن کاملA Family of Reversible BCH Codes
Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms as well as their theoretical importance. BCH codes form a subclass of cyclic codes and are very important in both theory and practice as they have good error-correcting capability and are widely used in communication systems, storage devices and consumer electronics. However, the dimens...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 40 شماره
صفحات -
تاریخ انتشار 1994